On the Distribution of Carmichael Numbers
نویسنده
چکیده
Pomerance conjectured that there are x 1− {1+o(1)} log log log x log log x Carmichael numbers up to x. At the time, his data tables up to 25 · 109 appeared to support his conjecture. However, Pinch extended this data and showed that up to 1021, Pomerance's conjecture did not appear well-supported. Thus, we build upon the work of Carl Pomerance and others to formulate an alternative conjecture regarding the distribution of Carmichael numbers that ts proven bounds and is roughly supported by Richard Pinch's data. All tables are included in the Appendix, and they are fully explained in the text.
منابع مشابه
Constructing Carmichael numbers through improved subset-product algorithms
We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed Carmichael numbers with k prime factors for every k between 3 and 19,565,220. These computations are the product of implementations of two new algorithms for the subset product problem that exploit the non-uniform distribution of primes p with the property that p − 1 divides a highly composite Λ.
متن کاملOn the Distributions of Pseudoprimes, Carmichael Numbers, and Strong Pseudoprimes
Building upon the work of Carl Pomerance and others, the central purpose of this discourse is to discuss the distribution of base-2 pseudoprimes, as well as improve upon Pomerance's conjecture regarding the Carmichael number counting function [8]. All conjectured formulas apply to any base b ≥ 2 for x ≥ x0(b). A table of base-2 pseudoprime, 2-strong pseudoprime, and Carmichael number counts up ...
متن کاملHigher - Order Carmichael Numbers Everett
We define a Carmichael number of order m to be a composite integer n such that nth-power raising defines an endomorphism of every Z/nZ-algebra that can be generated as a Z/nZ-module by m elements. We give a simple criterion to determine whether a number is a Carmichael number of order m, and we give a heuristic argument (based on an argument of Erdős for the usual Carmichael numbers) that indic...
متن کاملHigher-order Carmichael numbers
We define a Carmichael number of order m to be a composite integer n such that nth-power raising defines an endomorphism of every Z/nZalgebra that can be generated as a Z/nZ-module by m elements. We give a simple criterion to determine whether a number is a Carmichael number of order m, and we give a heuristic argument (based on an argument of Erdős for the usual Carmichael numbers) that indica...
متن کامل1 99 8 Higher - Order Carmichael Numbers Everett
We define a Carmichael number of order m to be a composite integer n such that nth-power raising defines an endomorphism of every Z/nZ-algebra that can be generated as a Z/nZ-module by m elements. We give a simple criterion to determine whether a number is a Carmichael number of order m, and we give a heuristic argument (based on an argument of Erdős for the usual Carmichael numbers) that indic...
متن کامل